Noise-tolerant distribution-free learning of general geometric concepts
نویسندگان
چکیده
منابع مشابه
Learning Geometric Concepts with Nasty Noise
We study the efficient learnability of geometric concept classes – specifically, low-degree polynomial threshold functions (PTFs) and intersections of halfspaces – when a fraction of the training data is adversarially corrupted. We give the first polynomial-time PAC learning algorithms for these concept classes with dimension-independent error guarantees in the presence of nasty noise under the...
متن کاملEfficient Distribution-Free Learning of Probabilistic Concepts
In this paper we investigate a new formal model of machine learning in which the concept (boolean function) to be learned may exhibit uncertain or probabilistic behavior|thus, the same input may sometimes be classiied as a positive example and sometimes as a negative example. Such probabilistic concepts (or p-concepts) may arise in situations such as weather prediction, where the measured varia...
متن کاملNoise Tolerant Inductive Learning
A novel iterative noise reduction learning algorithm is presented in which rules are learned in two phases. The ftrst phase improves the quality of training data through concept-driven closed-loop filtration process. In the second phase, classification rules are relearned from the filtered training dataset.
متن کاملE cient Distribution-free Learning of Probabilistic Concepts
In this paper we investigate a new formal model of machine learning in which the concept (boolean function) to be learned may exhibit uncertain or probabilistic behavior|thus, the same input may sometimes be classi ed as a positive example and sometimes as a negative example. Such probabilistic concepts (or p-concepts) may arise in situations such as weather prediction, where the measured varia...
متن کاملVerification as Learning Geometric Concepts
We formalize the problem of program verification as a learning problem, showing that invariants in program verification can be regarded as geometric concepts in machine learning. Safety properties define bad states: states a program should not reach. Program verification explains why a program’s set of reachable states is disjoint from the set of bad states. In Hoare Logic, these explanations a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1998
ISSN: 0004-5411,1557-735X
DOI: 10.1145/290179.290184